A Note on Scalar Multiplication Using Division Polynomials
نویسندگان
چکیده
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this paper we improve the efficiency of the Elliptic Net algorithm to compute scalar multiplication by using the equivalence of elliptic nets. The proposed method saves four multiplications in each iteration loop. Experimental results also indicates that our algorithm will be more efficient than the previously known results in this line.
منابع مشابه
Algebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملNote on fast division algorithm for polynomials using Newton iteration
The classical division algorithm for polynomials requires O(n) operations for inputs of size n. Using reversal technique and Newton iteration, it can be improved to O(M(n)), where M is a multiplication time. But the method requires that the degree of the modulo, x, should be the power of 2. If l is not a power of 2 and f(0) = 1, Gathen and Gerhard suggest to compute the inverse, f, modulo x r⌉,...
متن کاملThe Cyclic Decomposition Theorem
Let V be a finite-dimensional F -vector space, and let T : V → V be a linear transformation. In this note we prove that V is a direct sum of cyclic T -invariant subspaces. More specifically, we prove that V is a direct sum of cyclic T -invariant subspaces whose annihilators are generated by powers of irreducible polynomials, and that the collection of these polynomials is uniquely determined. R...
متن کامل18.783 Elliptic Curves: Lecture Notes 4
We saw in Lecture 3 how to efficiently multiply integers, and, using Kronecker substitution, how to efficiently multiply polynomials with integer coefficients. This gives us what we need to multiply elements in finite fields, provided that we have a way to reduce the result to our standard representations of Fp ' Z/pZ and Fq ' Fp[x]/(f), using integers in [0, p− 1] and polynomials of degree les...
متن کاملFast Operations on Linearized Polynomials and their Applications in Coding Theory
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial degree s, independent of the underlying field extension degree m. We show that our multiplication algorithm is faster than all known ones when s ≤ m. Using a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015